algorithm complexity的例句大全

Secondly, we discuss the complexity any algorithm solving RHC presents by counting the moving times of the tape head on turning machine.

在此基础上，通过分析通用图灵机带头移动的次数，讨论了通用图灵机上任一求解RHC的算法的复杂性。

The time complexity of the algorithm isO ( Lnd~ 2/ 2).

该算法的复杂度为O（Lnd~2/2），当dn时，算法具有线性复杂度。

Compared with KPP, this algorithm can construct a multicast tree with lower time complexity, thus can be used for large network to confirm multicast routing conveniently.

与KPP算法相比，DMR算法能够以较低的时间复杂度来构建多播树，从而可以较好地用于求解大型网络的多播路由问题。

The simulation results show that this algorithm can not only construct delay-constrained multicast tree correctly, but also has a less cost and a lower computational complexity than KPP.

仿真结果表明，该算法能正确地构造出时延约束组播树，同时还具有较低的代价和计算复杂度。

First several basic algorithms of Rough set methods are introduced with an analysis of the time complexity such as some efficient and incremental computing of indiscernibly relation and an improved algorithm of positive region.

具体研究工作如下：一.在Rough集的基本算法方面，提出了计算等价类的快速算法和增量算法以及计算正区域的改进算法，分析了算法的时间复杂度；

Complexity Analysis for the HEWN Algorithm-A Discussible Opinion

HEWN算法的复杂性分析&一点商榷意见

Based on Global Wavelet Penalty, a new gradient-based ILT algorithm is proposed for mask complexity reduction.

基于全局小波惩罚项，本文提出了一个新的反向光刻算法用于降低版图复杂度。

Simulation results show that algorithm can result in an acceptable performance with much lower decoding complexity.

仿真结果表明,合理选择分组参数能够以较小的性能损失换取译码复杂度的降低.

We present the concept, the algorithm and the complexity of Roll-Up.

提出了关联规则上探及相关的概念，并在此概念的基础上给出了上探的算法及复杂度分析。

The new algorithm decreases the computational complexity greatly , and increases the accuracy ofestimation greatly.

新算法降低了计算量, 提高了频偏估计精确度.

The experimental results illustrate that the proposed algorithm is effective and robust with low computational complexity.

实验结果表明该算法运算复杂度低,且具有较强的鲁棒性.

This two-semester course gives an in-depth introduction to algorithm design and computational complexity.

本课程介绍计算机算法设计及复杂性.

Even more, BLIS could also enables the low complexity, low hardware cost XY routing algorithm achieve similar or even better performance than the higher complexity, higher hardware requirements OE routing algorithm.

在一些模式下，BLIS还能使复杂度低、硬件需求少的XY路由算法在性能上接近甚至超过高复杂度、硬件需求高的OE算法。

Next, since the computation complexity of the proposed algorithm is relatively large, an improvement is made in the model of the scheduler and some strategies in reducing the scale of the second sub-problem are employed. Also we parallelize the proposed algorithm.

然后，针对所提出的方法存在的一些问题，改进了调度器模型同时对存储资源选择问题进行了规模上的缩减，并对算法做了并行处理、。

In this paper, we study the properties of the spanning arborescence in a network, and propose a simple algorithm for finding the minimum arborescence in a network, we also discuss the complexity of this algorithm and present an example for applying this algorithm.

研究网络中支撑树形图的性质，提出了在网络图中寻找最小树形图的简易算法，并对算法的复杂性进行了讨论，还给出应用该算法进行计算的一个实际算例。

Base on algorithm's convergence theory and calculation's complexity theory to analyze seriatim SUMT algorithm's convergence and genetic algorithm's convergence, and compare performance with each other.

以算法的收敛性理论和计算复杂性理论为基础，逐一分析SUMT算法以及遗传算法的收敛性，并比较三种算法的优劣性。

The proposed algorithm can overcome the drawback of CBP algorithm and its time complexity increases to.

该算法克服了CBP算法 机械选取节点进行划分的缺点,同时算法复杂度也增大到.

According to the low-complexity of R 22 SDF algorithm, a compatible FFT algorithm is proposed.

利用R22SDF算法的低复杂度的特点, 在其基础上演变出一种通用的FFT算法 .

The existing algorithm for Elliptic Curve discrete logarithm problem ( ECDLP ) is the whole index time complexity algorithm.

现有的求解 ECDLP 的算法都是全指数时间复杂度的算法.

Simulation results show that with complexity greatly reduced, piecewise linear approximation algorithm achieve a performance very close to that of the BP algorithm.

仿真结果表明，曲线折线化算法在复杂度大幅度降低的情况下性能接近BP算法。